The structure of the 2-factor transfer digraph common for rectangular, thick cylinder and Moebius strip grid graphs

In this paper, we prove that all but one of the components transfer digraph D? m needed for enumeration 2-factors in rectangular, thick cylinder and Moebius strip grid graphs fixed width (m ? N) are bipartite digraphs their orders could be expressed term binomial coefficients. addition, set vertices each component consists binary m-words which difference numbers zeros odd even positions is constant.